On Generalized Planar Skyline and Convex Hull Range Queries
نویسندگان
چکیده
We present output sensitive techniques for the generalized reporting versions of the planar range maxima problem and the planar range convex hull problem. Our solutions are in the pointer machine model, for orthogonal range queries on a static point set. We solve the planar range maxima problem for two-sided, three-sided and four-sided queries. We achieve a query time of O(log n+c) using O(n) space for the two-sided case, where n denotes the number of stored points and c the number of colors reported. For the three-sided case, we achieve query time O(log n + c log n) using O(n) space while for four-sided queries we answer queries in O(log n+ c log n) using O(n log n) space. For the planar range convex hull problem, we provide a solution that answers queries in O(log n+ c log n) time, using O(n log n) space.
منابع مشابه
Efficient Parallel Spatial Skyline Evaluation Using MapReduce
This research presents an advanced MapReduce-based parallel solution to efficiently address spatial skyline queries on large datasets. In particular, given a set of data points and a set of query points, we first generate the convex hull of the query points in the first MapReduce phase. Then, we propose a novel concept called independent regions, for parallelizing the process of spatial skyline...
متن کاملGeometry-Based Distributed Spatial Skyline Queries in Wireless Sensor Networks
Algorithms for skyline querying based on wireless sensor networks (WSNs) have been widely used in the field of environmental monitoring. Because of the multi-dimensional nature of the problem of monitoring spatial position, traditional skyline query strategies cause enormous computational costs and energy consumption. To ensure the efficient use of sensor energy, a geometry-based distributed sp...
متن کاملPlanar Convex Hull Range Query and Related Problems
We consider the planar convex hull range query problem. Let P be a set of points in the plane. We preprocess these points into a data structure such that given an orthogonal range query, we can report the convex hull of the points in the range in O(log n + h) time, where h is the size of the output. The data structure uses O(n log n) space. This improves the previous bound of O(log n+h) time an...
متن کاملDynamic Planar Convex Hull
In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(logn) time per operation. The space usage of the data structure is O(n). The data structure supports extreme point queries in a given direction, tangen...
متن کاملWindows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets
We study geometric data structures for sets of point-based temporal events, answering time-windowed queries, i.e., given a contiguous time interval we answer common geometric queries about the point events with time stamps in this interval. The geometric queries we consider include queries based on the skyline, convex hull, and proximity relations of the point set. We provide space efficient da...
متن کامل